• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ¹«¼± ³×Æ®¿öÅ©¿¡¼­ ÃÖ¼Ò Àü·Â ºê·Îµåij½ºÆ®¸¦ À§ÇÑ Æ®¸® ±â¹Ý Ž¿å ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) A Tree-based Greedy Algorithm for Minimum Power Broadcast in Wireless Networks
ÀúÀÚ(Author) À̵¿È£   Àå±æ¿õ   Dong-ho Lee   Kil-woong Jang  
¿ø¹®¼ö·Ïó(Citation) VOL 21 NO. 05 PP. 0921 ~ 0928 (2017. 05)
Çѱ۳»¿ë
(Korean Abstract)
À¯¼± ³×Æ®¿öÅ©¿Í ´Þ¸® ¹«¼± ³×Æ®¿öÅ© ȯ°æ¿¡¼­ÀÇ ºê·Îµåij½ºÆÃÀº ´ÜÀÏ Àü¼ÛÀ¸·Î ´Ù¼öÀÇ ³ëµå·Î µ¥ÀÌÅ͸¦ ÇÑ ¹ø¿¡ ¼Û½ÅÇÒ ¼ö ÀÖ´Ù. ¹«¼± ³×Æ®¿öÅ©¿¡¼­ ³ëµåÀÇ Àü¹æÇâ ºê·Îµåij½ºÆÃÀº ÀÎÁ¢ÇÑ ¸ðµç ³ëµå¿¡°Ô µ¿½Ã¿¡ µµ´ÞÇÑ´Ù. º» ³í¹®¿¡¼­´Â ¹«¼± ³×Æ®¿öÅ©¿¡¼­ ºê·Îµåij½ºÆà ½Ã Àüü ¼Û½Å Àü·ÂÀ» ÃÖ¼ÒÈ­ÇÏ´Â ÃÖ¼Ò Àü·Â ºê·Îµåij½ºÆà ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ Å½¿å ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº °¢ ³ëµåÀÇ ÃÖ´ë Àü¼Û ¹üÀ§ ³»¿¡¼­ ¸Þ½ÃÁö¸¦ Àü¼ÛÇÒ ¼ö ÀÖ´Â ³ëµåÀÇ ÁýÇÕÀÎ ÀÌ¿ô ³ëµå ¸®½ºÆ®¸¦ ÀÌ¿ëÇÏ¿© µ¥ÀÌÅ͸¦ ¼ö½ÅÇÑ ¼Û½Å ³ëµå Áß ÀÌ¿ô ³ëµå¸¦ °¡Àå ¸¹ÀÌ °¡Áö°í ÀÖ´Â ³ëµå°¡ ¿ì¼±ÀûÀ¸·Î ÀÌ¿ô ³ëµå·Î µ¥ÀÌÅ͸¦ Àü¼ÛÇÑ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº ÄÄÇ»ÅÍ ½Ã¹Ä·¹À̼ÇÀ» ÀÌ¿ëÇÏ¿© ¼º´ÉÆò°¡°¡ ÀÌ·ç¾îÁ³À¸¸ç, ³×Æ®¿öÅ©»óÀÇ ¸ðµç ³ëµå·Î ºê·Îµåij½ºÆà ½Ã ¼Ò¿äµÇ´Â ¼Û½Å Àü·Â°ú ºê·Îµåij½ºÆà Ƚ¼öÀÇ °üÁ¡¿¡¼­ ±âÁ¸ÀÇ ¾Ë°í¸®Áò°ú ºñ±³ÇÏ¿´´Ù. ½ÇÇè °á°ú¿¡¼­ Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº ±âÁ¸ÀÇ ¾Ë°í¸®Áòº¸´Ù ¼º´ÉÀÌ ¿ì¼öÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Unlike wired networks, broadcasting in wireless networks can transmit data to several nodes at a time in a single transmission. The omnidirectional broadcasting of node in wireless networks simultaneously reaches all neighboring nodes. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem that minimizes the total transmission power when broadcasting in wireless networks. The proposed algorithm uses a neighborhood list which is a set of nodes that can transmit messages within the maximum transmission range of each node, and among the transmitting nodes that have received the data, the node having the largest number of the neighboring nodes firstly transmits the data to neighboring node. The performance of the proposed algorithm was evaluated by computer simulation, and was compared with existing algorithms in terms of total transmission power and broadcasting frequency for broadcasting to all nodes. Experiment results show that the proposed algorithm outperforms the conventional algorithms.
Å°¿öµå(Keyword) ¹«¼± ³×Æ®¿öÅ©   ÃÖ¼Ò Àü·Â ºê·Îµåij½ºÆ®   ÃÖ¼Ò ºñ¿ë ½ÅÀå Æ®¸®   Ž¿å ¾Ë°í¸®Áò   Wireless networks   minimum power broadcast   minimum spanning tree   greedy algorithm  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå